Survey Propagation as "Probabilistic Token Passing"
نویسندگان
چکیده
منابع مشابه
Stability of Token Passing
Suucient stability condition for the standard token passing ring is "known" since the seminal paper of Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to research community. In fact, Watson observed that in the performance evaluation of token passing rings "it is convenient to derive stability conditions ... (without pr...
متن کاملVirtual Token-passing Ethernet – Vtpe
The amount of information that must be exchanged in modern Digital Computer Control Systems (DCCS) and real-time industrial automation is now reaching the limits that are achievable with traditional fieldbuses. Currently, Ethernet is increasingly used in DCCS, however, the available solutions to guarantee real-time behaviour in Ethernet are not well suited to support the DCCS requirements and c...
متن کاملStability of token passing rings
A sufficient stability condition for the standard token passing ring has been "known" since the seminal paper by Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to the research community. In fact, Watson observed that in the performance evaluation of token passing rings, "it is convenient to derive stability conditions....
متن کاملStability of token passing rings
Wojciech SzpankowsklDepartment of Computer Science Purdue University W. Lafayette, IN 47907 U.S.A. The stability condition for the standard token passing ring is "known" since the seminal paper of Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to research community. In fact, Watson observed that in the performance eval...
متن کاملPermutations Generated by Token Passing in Graphs
A transportation graph is a directed graph with a designated input node and a designated output node. Initially, the input node contains an ordered set of tokens 1,2,3, . . The tokens are removed from the input node in this order and transferred through the graph to the output node in a series of moves; each move transfers a token from a node to an adjacent node. Two or more tokens cannot resid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2008
ISSN: 0916-8532,1745-1361
DOI: 10.1093/ietisy/e91-d.2.231